A Verification Technique Using Term Rewriting Systems and Abstract Interpretation
نویسنده
چکیده
Verifying the safety property of a transition system given by a term rewriting system is an undecidable problem. In this paper, we give an abstraction for the problem which is automatically generated from a given TRS by using abstract interpretation. Then we show that there are some cases in which the problem can be decided. Also we show a new decidable subclass of term rewriting systems which effectively preserves recognizability.
منابع مشابه
A Theory for Abstract Reduction Systems in PVS
A theory for Abstract Reduction Systems (ARS) in the proof assistant PVS (Prototype Verification System) is described. Adequate specifications of basic definitions and notions such as reduction, confluence, normal form are given and well-known results proved, which includes non trivial ones such as Noetherian Induction, Newman’s Lemma and its generalizations, and Commutation Lemma among others....
متن کاملRewriting-based Verification and Debugging of Web Systems
The increasing complexity of Web system has led to the development of sophisticated formal methodologies for verifying and correcting Web data and Web programs. In general, establishing whether a Web system behaves correctly with respect to the original intention of the programmer or checking its internal consistency are non-trivial tasks as witnessed by many studies in the literature. In this ...
متن کاملSimulating liveness by reduction strategies
We define a general framework to handle liveness and related properties by reduction strategies in abstract reduction and term rewriting. Classically, reduction strategies in rewriting are used to simulate the evaluation process in programming languages. The aim of our work is to use reduction strategies to also study liveness questions which are of high importance in practice (e.g., in protoco...
متن کاملAutomatically finding particular term rewriting systems
Our goal is to give a list of rewriting properties, and then automatically find a term rewriting system (TRS) satisfying these properties. In earlier work we did this for finite abstract reduction systems; in this paper we extend the approach to ground term rewriting systems over constants and one unary symbol. In particular, we fully automatically find a TRS that is locally confluent but not c...
متن کاملPrecise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation
We propose a new approach for producing precise constrained slices of programs in a language such as C. We build upon a previous approach for this problem, which is based on term-rewriting, which primarily targets loop-free fragments and is fully precise in this setting. We incorporate abstract interpretation into term-rewriting, using a given arbitrary abstract lattice, resulting in a novel te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004